Boolean Constraint Solving Using clp(FD)

Compiling Constraints in clp(FD)

We present the clp(FD) system: a Constraint Logic Programming language with finite domain constraints. We detail its implementation and present an abstract instruction set for the constraint solver that can be smoothly integrated into the WAM architecture. It is based on the use of a single primitive constraintX in r that embeds the core propagation mechanism. Complex user constraints such as l...

Extending clp(FD) by Negative Constraint Solving

In this paper we present a novel extension to the constraint logic programming on Finite Domains (clp(FD)) which combines the usual clp(FD) primitive constraint X in range with a new primitive constraint X notin range. We show that, together, they are more expressive and provide better constraint propagation than having X in range on its own. It is shown how the standard clp(FD) framework can b...

Programming with TOY(FD)

In [1] we presented the language T OY(FD) that integrates the best features of existing functional and logic languages, as well as finite domain (FD) constraint solving. We believe that T OY(FD) is more flexible and expressive than the existing approaches of constraint logic programming on finite domain (CLP (FD) ) as it integrates FD constraint solving, lazy evaluation, higher order applicatio...

Constraint Satisfaction Using Constraint Logic Programming

Van Hentenryck, P., H. Simonis and M. Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence 58 (1992) 113-159. Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment). CLP languages naturally combine constraint propagation ...

Boolean Constraint Solving Using lp(FD)